A New Approach to Simplifying Boolean Functions
نویسندگان
چکیده
منابع مشابه
New Approach to Learning Noisy Boolean Functions
We give a new formulation of noise removal from data being Boolean functions used in Conceptual Inductive Learning. The algorithm is used as a part of a functional decomposition program. Paper gives an eecient heuristic algorithm for the minimization of multi-output Exclusive DNF (EDNF) expressions that generalize the Disjunctive Normal Forms (DNF) expressions popularly used in Machine Learning...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولSimplifying Boolean Networks
This paper explores the compressibility of complex systems by considering the simplification of Boolean networks. A method, which is similar to that reported by Bastolla and Parisi,4,5 is considered that is based on the removal of frozen nodes, or stable variables, and network “leaves,” i.e. those nodes with outdegree = 0. The method uses a random sampling approach to identify the minimum set o...
متن کاملA new approach to using the cubic B-spline functions to solve the Black-Scholes equation
Nowadays, options are common financial derivatives. For this reason, by increase of applications for these financial derivatives, the problem of options pricing is one of the most important economic issues. With the development of stochastic models, the need for randomly computational methods caused the generation of a new field called financial engineering. In the financial engineering the pre...
متن کاملA New Decomposition of Boolean Functions
This paper introduces a new type of decomposition of Boolean functions, partitioning the original function into disjoint chains of cubes. We show that using this type of decomposition as a preprocessing step in logic synthesis algorithms may lead to a considerable reduction in the run-time thus allowing to process larger functions, which otherwise cannot be handled due to the time limit.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Engineering Research [TJER]
سال: 2004
ISSN: 1726-6742,1726-6009
DOI: 10.24200/tjer.vol1iss1pp39-45